Secrecy by Witness Functions
نویسندگان
چکیده
In this paper, we introduce a new type of functions to analyze cryptographic protocols statically for the property of secrecy: the Witness-Functions. A Witness-Function is a reliable protocol-dependent function intended to prove the correctness of a protocol through its growth. It bases its calculation on the static part of a message in a role-based speci cation and ignores the dynamic one by introducing the notion of derivative messages. It o ers two interesting bounds that enable an analysis of protocols on an unbounded number of sessions. We give here the way to build these functions and we state the theorem of protocol analysis with the Witness-Functions.
منابع مشابه
A Semi-Decidable Procedure for Secrecy in Cryptographic Protocols
In this paper, we present a new semi-decidable procedure to analyze cryptographic protocols for secrecy based on a new class of functions that we call: the Witness-Functions. A Witness-Function is a reliable function that guarantees the secrecy in any protocol proved increasing once analyzed by it. Hence, the problem of correctness becomes a problem of protocol growth. A Witness-Function operat...
متن کاملA Theorem for Secrecy in Tagged Protocols Using the Theory of Witness-Functions
In this paper, we enunciate the theorem of secrecy in tagged protocols using the theory of witness-functions and we run a formal analysis on a new tagged version of the Needham-Schroeder public-key protocol using this theorem. We discuss the significance of tagging in securing cryptographic protocols as well.
متن کاملNew Functions for Secrecy on Real Protocols
In this paper, we present new functions for secrecy in cryptographic protocols:the witnessfunctions. A witness-function is a protocol-dependent function that is able to prove the correctness of a protocol through its growth. It bases its calculation on the static part of a message only in a role-based specification by using derivation techniques. We show here how to build them. Then, we run an ...
متن کاملThe Witness Function Method and Provably Recursive Functions of Peano Arithmetic
This paper presents a new proof of the characterization of the provably recursive functions of the fragments IΣn of Peano arithmetic. The proof method also characterizes the Σk -definable functions of IΣn and of theories axiomatized by transfinite induction on ordinals. The proofs are completely proof-theoretic and use the method of witness functions and witness oracles. Similar methods also yi...
متن کاملDerandomization in Cryptography
We give two applications of Nisan–Wigderson-type (“non-cryptographic”) pseudorandom generators in cryptography. Specifically, assuming the existence of an appropriate NW-type generator, we construct: 1. A one-message witness-indistinguishable proof system for every language in NP, based on any trapdoor permutation. This proof system does not assume a shared random string or any setup assumption...
متن کامل